翻訳と辞書 Words near each other ・ Minimal surface ・ Minimal surface of revolution ・ Minimal techno ・ Minimal Traditional ・ Minimal volume ・ Minimal wave ・ Minimal Wave Records ・ Minimal Working Example ・ Minimal-access cranial suspension ・ Minimal-entropy martingale measure ・ Minimalism ・ Minimalism (computing) ・ Minimalism (disambiguation) ・ Minimalism (technical communication) ・ Minimalism (visual arts) ・ Minimalist grammar ・ Minimalist program ・ Minimalist shoe ・ Minimalistix ・ Minimally conscious state ・ Minimally differentiated acute myeloblastic leukemia ・ Minimally disruptive medicine ・ Minimally invasive adenocarcinoma of the lung ・ Minimally invasive cardiac surgery ・ Minimally invasive direct coronary artery bypass surgery ・ Minimally invasive education ・ Minimally invasive hip resurfacing ・ Minimally invasive plate metalosynthesis ・ Minimally Invasive Thorasic Spinal Fusion ・ Minimally invasive warrantless search Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Minimalist grammar ： ウィキペディア英語版 Minimalist grammar Minimalist grammars are a class of formal grammars that aim to provide a more rigorous, usually proof-theoretic, formalization of Chomskyan Minimalist program than is normally provided in the mainstream Minimalist literature. A variety of particular formalizations exist, most of them developed by Edward Stabler, Alain Lecomte, Christian Retoré, or combinations thereof. ==Lecomte and Retoré's extensions of the Lambek Calculus== Lecomte and Retoré (2001) introduces a formalism that modifies that core of the Lambek Calculus to allow for movement-like processes to be described without resort to the combinatorics of Combinatory categorial grammar. The formalism is presented in proof-theoretic terms. Differing only slightly in notation from Lecomte and Retoré (2001), we can define a minimalist grammar as a 3-tuple $G\; =\; (C,\; F,\; L)$, where ''C'' is a set of "categorial" features, ''F'' is a set of "functional" features (which come in two flavors, "weak", denoted simply ''f'', and "strong", denoted ''f *''), and L is a set of lexical atoms, denoted as pairs $w\; :\; t$, where ''w'' is some phonological/orthographic content, and ''t'' is a syntactic type defined recursively as follows: : all features in ''C'' and ''F'' are (atomic) types, and : if ''X'' and ''Y'' are types, so are ''X/Y'', ''X\Y'', and $X\; \backslash circ\; Y$. We can now define 6 inferences rules: : $\backslash vdash\; w\; :\; X$, for all $w\; :\; X\; \backslash in\; L$ : $w\; :\; X\; \backslash vdash\; w\; :\; X$, for all $w\; :\; X\; \backslash notin\; L$ : $\backslash frac()$ : $\backslash frac(E)$ : $\backslash frac\; entropy$ : $\backslash frac(E)$ The first rule merely makes it possible to use lexical items with no extra assumptions. The second rule is just a means of introducing assumptions into the derivation. The third and fourth rules just perform directional feature checking, combining the assumptions required to build the subparts that are being combined. The entropy rule presumably allows the ordered sequents to be broken up into unordered sequents. And finally, the last rule implements "movement" by means of assumption elimination. The last rule can be given a number of different interpretations in order to fully mimic movement of the normal sort found in the Minimalist Program. The account given by Lecomte and Retoré (2001) is that if one of the product types is a strong functional feature, then the phonological/orthographic content associated with that type on the right is substituted with the content of the ''a'', and the other is substituted with the empty string; whereas if neither is strong, then the phonological/orthographic content is substituted for the category feature, and the empty string is substituted for the weak functional feature. That is, we can rephrase the rule as two sub-rules as follows: : $\backslash frac,\; \backslash Delta\text{'}\; \backslash vdash\; d\; :\; Z\}(E\_)$ where $X\; \backslash in\; C,\; Y^\; \backslash in\; F$ : $\backslash frac(E\_)$ where $X\; \backslash in\; C,\; Y\; \backslash in\; F$ Another alternative would be to construct pairs in the ''/E'' and ''\E'' steps, and use the $\backslash circ\; E$ rule as given, substituting the phonological/orthographic content ''a'' into the highest of the substitution positions, and the empty string in the rest of the positions. This would be more in line with the Minimalist Program, given that multiple movements of an item are possible, where only the highest position is "spelled out". 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Minimalist grammar」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.